Certifying Factory Surgeons

Certifying algorithms

Certifying RSA

We propose an algorithm that, given an arbitrary N of unknown factorization and prime e ≥ N 1 4 , certifies whether the RSA function RSAN,e(x) := x e mod N defines a permutation over ZN or not. The algorithm uses Coppersmith’s method to find small solutions of polynomial equations and runs in time O(ε−8 logN). Previous certification techniques required e > N .

Certifying Trust

A basic function of all signatures, digital or not, is to express trust and authority, explicit or implied. This is especially the case with digital signatures used in certificates. In this paper, we study the trust relationships expressed by the certificates used in X.509, PGP and SPKI. Especially, we present and revise the idea of a certificate loop, or a loop of certificates from the verifyi...

Urals factory hospitals and surgeons at the dawn of the nineteenth century.

INTRODUCTION: THE INDUSTRY AND ITS PROBLEMS AT THE BEGINNING of the nineteenth century 128 mines and metallurgical factories were in operation in the Ural Mountains. Many had been destroyed in Pugachev's rebellion (1773) but they had been quickly rebuilt. As a result of periodic changes in government policy in the previous century, when private enterprise was alternately encouraged and discoura...

Finding and Certifying Loops

The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional formulas such that a loop can be extracted from a satisfying assignment. Alternatively, loops can be found by enumerating forward closures. In the second part we give a formalization of loops in the theorem prover Isabelle/HOL. Aft...